BIF: Balanced Incomplete Factorization
نویسنده
چکیده
Incomplete factorizations represent a class of algebraic preconditioners important from both theoretical and practical points of view. While state-of-the-art preconditioners of this kind can be very useful, very large problems, arising, e.g., from discretizations of complicated operators on unstructured grids typically, still may require more robust preconditioners. High-quality incomplete factorizations are also needed inside some multilevel schemes and in non-PDE applications.
منابع مشابه
Balanced Incomplete Factorization
In this paper we present a new incomplete factorization of a square matrix into triangular factors in which we get standard LU or LDL T factors (direct factors) and their inverses (inverse factors) at the same time. Algorithmically, we derive this method from the approach based on the Sherman-Morrison formula [18]. In contrast to the RIF algorithm [11], the direct and inverse factors here direc...
متن کاملImproved Balanced Incomplete Factorization
In this paper we improve the BIF algorithm which computes simultaneously the LU factors (direct factors) of a given matrix, and their inverses (inverse factors). This algorithm was introduced in [R. Bru, J. Maŕın, J. Mas and M. Tůma, SIAM J. Sci. Comput., 30 (2008), pp. 2302– 2318]. The improvements are based on a deeper understanding of the Inverse Sherman-Morrison (ISM) decomposition and they...
متن کاملPreconditioned Iterative Methods for Solving Linear Least Squares Problems
New preconditioning strategies for solving m × n overdetermined large and sparse linear least squares problems using the CGLS method are described. First, direct preconditioning of the normal equations by the Balanced Incomplete Factorization (BIF) for symmetric and positive definite matrices is studied and a new breakdown-free strategy is proposed. Preconditioning based on the incomplete LU fa...
متن کاملComputing a block incomplete LU preconditioner as the by-product of block left-looking A-biconjugation process
In this paper, we present a block version of incomplete LU preconditioner which is computed as the by-product of block A-biconjugation process. The pivot entries of this block preconditioner are one by one or two by two blocks. The L and U factors of this block preconditioner are computed separately. The block pivot selection of this preconditioner is inherited from one of the block versions of...
متن کاملCIMGS: An Incomplete Orthogonal FactorizationPreconditioner
A new preconditioner for symmetric positive definite systems is proposed, analyzed, and tested. The preconditioner, compressed incomplete modified Gram–Schmidt (CIMGS), is based on an incomplete orthogonal factorization. CIMGS is robust both theoretically and empirically, existing (in exact arithmetic) for any full rank matrix. Numerically it is more robust than an incomplete Cholesky factoriza...
متن کامل